A Novel Family of Subspace Methods—Protoface and Its Kernel Version
نویسندگان
چکیده
In this paper, we present a novel feature extraction called the protoface. While the Eigenface is based on principal component analysis and the Fisherface on Fisher’s linear discriminant analysis, the protoface only requires decomposing the covariance matrix of the prototypes that can better describe whole observations. It is thus more computationally efficient especially when the number of the observations is large. Moreover, instead of using the method of multivariate analysis of variance, protoface relies on the analysis of distance. It is thus more appropriate in situations where the assumptions of normality of the observations are violated. Besides, by using the kernel trick, we also obtain a kernel protoface in the feature space defined by the kernel. Finally, we apply our methods to face recognition, and experimental results on both the AT&T and Yale databases are reported.
منابع مشابه
A family of kernel subspace classifiers
Abstract We present a family of kernel subspace classifiers and their extensions. There are two kinds of regularization methods and they have a degree of freedom about a null space of the operator in the family. Regularization is important to avoid the over-fitting problem in the machine learning theory. The applicable null space of an operator is able to suppress the effect of the other classe...
متن کاملA Novel Noise Reduction Method Based on Subspace Division
This article presents a new subspace-based technique for reducing the noise of signals in time-series. In the proposed approach, the signal is initially represented as a data matrix. Then using Singular Value Decomposition (SVD), noisy data matrix is divided into signal subspace and noise subspace. In this subspace division, each derivative of the singular values with respect to rank order is u...
متن کاملA Novel Noise Reduction Method Based on Subspace Division
This article presents a new subspace-based technique for reducing the noise of signals in time-series. In the proposed approach, the signal is initially represented as a data matrix. Then using Singular Value Decomposition (SVD), noisy data matrix is divided into signal subspace and noise subspace. In this subspace division, each derivative of the singular values with respect to rank order is u...
متن کاملCancer molecular pattern discovery by subspace consensus kernel classification.
Cancer molecular pattern efficient discovery is essential in the molecular diagnostics. The characteristics of the gene/protein expression data are challenging traditional unsupervised classification algorithms. In this work, we describe a subspace consensus kernel clustering algorithm based on the projected gradient nonnegative matrix factorization (PG-NMF). The algorithm is a consensus kernel...
متن کاملA Theorem of Krein Revisited
M. Krein proved in [KR48] that if T is a continuous operator on a normed space leaving invariant an open cone, then its adjoint T ∗ has an eigenvector. We present generalizations of this result as well as some applications to C∗-algebras, operators on l1, operators with invariant sets, contractions on Banach lattices, the Invariant Subspace Problem, and von Neumann algebras. M. Krein proved in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002